Resolvable Even-Cycle Systems with a 1-Rotational Automorphism
نویسندگان
چکیده
In this article, necessary and sufficient conditions for the existence of a 1rotationally resolvable even-cycle system of kKv are given, which are eventually for the existence of a resolvable even-cycle system of kKv . # 2003 Wiley Periodicals, Inc. J Combin Designs 11: 394–407, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10058
منابع مشابه
Cyclic resolutions of the BIB design in PG(5, 2)
The BIB design in PG(n,2), which is the n-dimensional projective geometry over GF(2), has the following automorphisms: (i) an automorphism of order v = 2+ 1; (ii) an automorphism of order w = 2n 1. A BIB design with the first automorphism is called a cyclic BIB design, and one with the second is called a 2-rotational BIB design. In PG(n, 2), a BIB design generated by the points and planes has p...
متن کاملFrom a 1-Rotational RBIBD to a Partitioned Difference Family
Generalizing the case of λ = 1 given by Buratti and Zuanni [Bull Belg. Math. Soc. (1998)], we characterize the 1-rotational difference families generating a 1rotational (v, k, λ)-RBIBD, that is a (v, k, λ) resolvable balanced incomplete block design admitting an automorphism group G acting sharply transitively on all but one point ∞ and leaving invariant a resolution R of it. When G is transiti...
متن کاملClassification of Resolvable 2-(14,7,12) and 3-(14,7,5) Designs
The resolvable 2-(14, 7, 12) designs are classified in a computer search: there are 1, 363, 486 such designs, 1, 360, 800 of which have trivial full automorphism group. Since every resolvable 2-(14, 7, 12) design is also a resolvable 3-(14, 7, 5) design and vice versa, the latter designs are simultaneously classified. The computer search utilizes the fact that these designs are equivalent to ce...
متن کاملKirkman triple systems of order 21 with nontrivial automorphism group
There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, this leads to a collection of 63,745 nonisomorphic Kirkman triple systems of order 21. This includes all KTS(21)s having a nontrivial automorphi...
متن کاملConstructing 1-rotational NRDFs through an Optimization Approach: New (46,9,8), (51,10,9) and (55,9,8)-NRBDs
In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolva...
متن کامل